Depth-Complexity Based Occluder-Selection

ثبت نشده
چکیده

This paper discusses the run-time results from a walkthrough of an architectural scene on a 350Mhz Pentium II. The graphics code is based on OpenGL and accelerated via an nVidia GeForce256 processor. The scene contains 439 808 polygons (quads) and 868 095 vertices. It is hierarchically subdivided into 5 504 objects (leaves of the bounding box hierarchy) and requires about 142MB on Windows 2000. Figure 1 shows a screenshot of the scene and the resulting occlusion-map.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image-based Occluder Selection

In many cases complex scenes are composed of densely occluded objects, which means that only a small fraction of the scene is visible, while the remaining parts are occluded. This property can be exploited to accelerate rendering by simply removing most of the hidden parts before sending the polygons to the graphics hardware. In recent years, a lot of so called occlusion-culling methods have be...

متن کامل

Image-based Occluder Selection: an Introductory Overview

In many cases complex scenes are composed of densely occluded objects, which means that only a small fraction of the scene is visible, while the remaining parts are occluded. This property can be exploited to accelerate rendering by simply removing most of the hidden parts before sending the polygons to the graphics hardware. In recent years, a lot of so called occlusion-culling methods have be...

متن کامل

Disparity biasing in depth from monocular occlusions

Monocular occlusions have been shown to play an important role in stereopsis. Among other contributions to binocular depth perception, monocular occlusions can create percepts of illusory occluding surfaces. It has been argued that the precise location in depth of these illusory occluders is based on the constraints imposed by occlusion geometry. Tsirlin et al. (2010) proposed that when these c...

متن کامل

3D Scene and Object Classification Based on Information Complexity of Depth Data

In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...

متن کامل

The role of transparency in da Vinci stereopsis

The majority of natural scenes contains zones that are visible to one eye only. Past studies have shown that these monocular regions can be seen at a precise depth even though there are no binocular disparities that uniquely constrain their locations in depth. In the so-called da Vinci stereopsis configuration, the monocular region is a vertical line placed next to a binocular rectangular occlu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002